Proposed Gaussian Kernel Support Vector Machines for Regression
ثبت نشده
چکیده
منابع مشابه
Designing Kernel Functions Using the Karhunen-Loève Expansion
In recent years, a number of kernel-based learning algorithms such as the regularization networks [1], the support vector machines [7, 4, 5], and the Gaussian process regression [8] have been investigated. These kernel machines are shown to work very well on real-world problems, given appropriate kernel functions. For general purposes, the Gaussian kernel is widely used and seems to work well [...
متن کاملRelationships between Gaussian processes, Support Vector machines and Smoothing Splines
Bayesian Gaussian processes and Support Vector machines are powerful kernel-based methods to attack the pattern recognition problem. Probably due to the very different philosophies of the fields they have been originally proposed in, techniques for these two models have been developed somewhat in isolation from each other. This tutorial paper reviews relationships between Bayesian Gaussian proc...
متن کاملA Gradient-based Forward Greedy Algorithm for Sparse Gaussian Process Regression
In this chaper, we present a gradient-based forward greedy method for sparse approximation of Bayesian Gaussian Process Regression (GPR) model. Different from previous work, which is mostly based on various basis vector selection strategies, we propose to construct instead of select a new basis vector at each iterative step. This idea was motivated from the well-known gradient boosting approach...
متن کاملImproved fast Gauss transform User manual
In most kernel based machine learning algorithms and non-parametric statistics the key computational task is to compute a linear combination of local kernel functions centered on the training data, i.e., f(x) = ∑N i=1 qik(x, xi), which is the discrete Gauss transform for the Gaussian kernel. f is the regression/classification function in case of regularized least squares, Gaussian process regre...
متن کاملA Gradient-Based Forward Greedy Algorithm for Space Gaussian Process Regression
In this chaper, we present a gradient-based forward greedy method for sparse approximation of Bayesian Gaussian Process Regression (GPR) model. Different from previous work, which is mostly based on various basis vector selection strategies, we propose to construct instead of select a new basis vector at each iterative step. This idea was motivated from the well-known gradient boosting approach...
متن کامل